Transforming Coroutining Logic Programs into Equivalent CHR Programs
نویسندگان
چکیده
منابع مشابه
Transforming Coroutining Logic Programs into Equivalent CHR Programs
We extend a technique called Compiling Control. The technique transforms coroutining logic programs into logic programs that, when executed under the standard left-to-right selection rule (and not using any delay features) have the same computational behavior as the coroutining program. In recent work, we revised Compiling Control and reformulated it as an instance of Abstract Conjunctive Parti...
متن کاملTransforming Functional Logic Programs into Monadic Functional Programs
We present a high-level transformation scheme to translate lazy functional logic programs into pure Haskell programs. This transformation is based on a recent proposal to efficiently implement lazy non-deterministic computations in Haskell in a monadic style. We build on this work and define a systematic method to transform lazy functional logic programs into monadic programs with explicit shar...
متن کاملTransforming Abductive Logic Programs to Disjunctive Programs
A new xpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the xpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterizati...
متن کاملCoroutining and the Construction of Terminating Logic Programs
This paper investigates the role of coroutining in the termination of logic programs. We deene a variant of SLD resolution, in which the execution of atoms may be suspended indeenitely, and give some basic results concerning success, nite failure and oundering. Next we discuss how correct procedures can be combined to form new procedures using disjunction, conjunction and recursion. We argue th...
متن کاملStrongly Equivalent Temporal Logic Programs
This paper analyses the idea of strong equivalence for transition systems represented as logic programs under the Answer Set Programming (ASP) paradigm. To check strong equivalence, we use a linear temporal extension of Equilibrium Logic (a logical characterisation of ASP) and its monotonic basis, the intermediate logic of Here-and-There (HT). Trivially, equivalence in this temporal extension o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.253.4